翻訳と辞書 Words near each other ・ Quetzalpetlatl Corona ・ Quetzaltenango ・ Quetzaltenango Airport ・ Quetzaltenango Department ・ Quetzaltenango Guatemala Temple ・ Quetzaltenango Municipal Theatre ・ Quetzaltepec ・ Quetzatl ・ QuetzSat 1 ・ Queuco River ・ Queudes ・ Queue ・ Queue (abstract data type) ・ Queue (hairstyle) ・ Queue area ・ Queue automaton ・ Queue jump ・ Queue management system ・ Queue number ・ Queued Sequential Access Method ・ Queued Telecommunications Access Method ・ Queueing Systems ・ Queueing theory ・ Queuille ・ Queuine ・ Queuine tRNA-ribosyltransferase ・ Queuing delay ・ Queula ・ Queulat National Park ・ Queule Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Queue automaton ： ウィキペディア英語版 Queue automaton A queue machine or queue automaton is a finite state machine with the ability to store and retrieve data from an infinite-memory queue. It is a model of computation equivalent to a Turing machine, and therefore it can process any formal language. == Theory == We define a queue machine by the six-tuple :$M\; =\; (Q,\; \backslash Sigma,\; \backslash Gamma,\; \backslash \$,\; s,\; \backslash delta)$ where * $\backslash ,Q$ is a finite set of ''states''; * $\backslash ,\backslash Sigma\; \backslash subset\; \backslash Gamma$ is the finite set of the ''input alphabet''; * $\backslash ,\backslash Gamma$ is the finite ''queue alphabet''; * $\backslash ,\backslash \$\; \backslash in\; \backslash Gamma\; -\; \backslash Sigma$ is the ''initial queue symbol''; * $\backslash ,s\; \backslash in\; Q$ is the ''start state''; * $\backslash ,\backslash delta\; :\; Q\; \backslash times\; \backslash Gamma\; \backslash rightarrow\; Q\; \backslash times\; \backslash Gamma^$ * is the ''transition function''. We define the current status of the machine by a ''configuration'', an ordered pair of its state and queue contents $\backslash ,(q,\backslash gamma)\backslash in\; Q\backslash times\backslash Gamma^$ * (note $\backslash ,\backslash Gamma^$ * defines the Kleene closure or set of all supersets of $\backslash ,\backslash Gamma$). The starting configuration on an input string $\backslash ,x$ is defined as $\backslash ,(s,x\backslash \$)$, and the transition $\backslash rightarrow\_M^1$ from one configuration to the next is defined as: :$\backslash ,(p,A\backslash alpha)\; \backslash rightarrow\_M^1\; (q,\backslash alpha\backslash gamma)$ where $A$ is a symbol from the queue alphabet, $\backslash alpha$ is a sequence of queue symbols ($\backslash alpha\; \backslash in\; \backslash Gamma^$ *), and $(q,\; \backslash gamma)\; =\; \backslash delta(p,\; A)$. Note the "first-in-first-out" property of the queue in the relation. The machine accepts a string $\backslash ,x\backslash in\backslash Sigma^$ * if after a (possibly infinite) number of transitions the starting configuration evolves to exhaust the string (reaching a null string $\backslash ,\backslash epsilon$), or $\backslash ,(s,x\backslash \$)\backslash rightarrow\_M^$ *(q,\epsilon). 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Queue automaton」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.